Discovery of maximum length frequent itemsets
نویسندگان
چکیده
منابع مشابه
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often sufficient to mine a small representative subset of frequent itemsets with low computational cost. To that end, in this paper, we define a new problem of finding the frequent itemsets with a maximum length and present ...
متن کاملEfficient Tree-based Discovery of Frequent Itemsets
Various types of data structures and algorithms have been proposed to extract frequently occurring patterns from a given data set. In particular, several tree structures have been devised to represent the input data set for efficient pattern discovery. One of the fastest frequent pattern mining algorithms known to date is the CATS algorithm, which can efficiently represent the whole data set an...
متن کاملDiscovery of Frequent Itemsets: Frequent Item Tree-Based Approach
Mining frequent patterns in large transactional databases is a highly researched area in the field of data mining. Existing frequent pattern discovering algorithms suffer from many problems regarding the high memory dependency when mining large amount of data, computational and I/O cost. Additionally, the recursive mining process to mine these structures is also too voracious in memory resource...
متن کاملData Access Paths for Frequent Itemsets Discovery
Many frequent itemset discovery algorithms have been proposed in the area of data mining research. The algorithms exhibit significant computational complexity, resulting in long processing times. Their performance is also dependent on source data characteristics. We argue that users should not be responsible for choosing the most efficient algorithm to solve a particular data mining problem. In...
متن کاملEfficient Discovery of Association Rules and Frequent Itemsets through Sampling
Discovery of frequent itemsets and association rules is a fundamental computational primitive with application in data mining (market basket analysis), databases (histogram construction), networking (heavy hitters) and more [Han et al., 2007, Sect. 5]. Depending on the particular application, one is interested in finding all itemsets with frequency greater or equal to a user defined threshold (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2008
ISSN: 0020-0255
DOI: 10.1016/j.ins.2007.08.006